Enumeration formulas for standard young tableaux of approximate C shape

نویسندگان

چکیده

This paper focuses on the combinatorial enumeration of truncated hollow standard Young tableaux approximate C shape. The formula approximately C-shaped SYT, namely convolution Catalan numbers, is derived by using multi-integral method based sequence statistical model. Meanwhile, it found that first and last rows differ in number boxes. In case where boxes row n large enough, SYT does not change, especially if m = 1, whether closely related to number. addition, we present two main closed formulas for SYTs angular "T" shapes.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Enumeration of Semi { Standard Young Tableaux

Standard tableaux. A Young tableau (also known as a standard tableau) is an arrangement of distinct integers in an array of left justiied rows, such that the entries of each row are in increasing order from left to right and the entries of each column are in increasing order from bottom to top 2. For instance, here is an array of size 15: 11 4 8 12 14 3 6 7 13 1 2 5 9 10 15 : In general a table...

متن کامل

Enumeration formulas for Young tableaux in a diagonal strip

We derive combinatorial identities, involving the Bernoulli and Euler numbers, for the numbers of standard Young tableaux of certain skew shapes. This generalizes the classical formulas of D. André on the number of up-down permutations. The analysis uses a transfer operator approach extending the method of Elkies, combined with an identity expressing the volume of a certain polytope in terms of...

متن کامل

Enumeration of Standard Young Tableaux of certain Truncated Shapes

Unexpected product formulas for the number of standard Young tableaux of certain truncated shapes are found and proved. These include shifted staircase shapes minus a square in the NE corner, rectangular shapes minus a square in the NE corner, and some variations.

متن کامل

Bijective proofs of the hook formulas for the number of standard Young tableaux, ordinary and shifted

Bijective proofs of the hook formulas for the number of ordinary standard Young tableaux and for the number of shifted standard Young tableaux are given. They are formulated in a uniform manner, and in fact prove q-analogues of the ordinary and shifted hook formulas. The proofs proceed by combining the ordinary, respectively shifted, Hillman–Grassl algorithm and Stanley's (P, ω)-partition theor...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Physics: Conference Series

سال: 2021

ISSN: ['1742-6588', '1742-6596']

DOI: https://doi.org/10.1088/1742-6596/1978/1/012035